Positive-definite matrix

Results: 90



#Item
41ETNA  Electronic Transactions on Numerical Analysis. Volume 35, pp[removed], 2009. Copyright  2009, Kent State University. ISSN[removed].

ETNA Electronic Transactions on Numerical Analysis. Volume 35, pp[removed], 2009. Copyright  2009, Kent State University. ISSN[removed].

Add to Reading List

Source URL: www.univie.ac.at

Language: English - Date: 2009-06-24 17:07:06
42Filename: Ellipint  Circumscribing an Ellipsoid about the Intersection … August 16, 2006 5:03 am

Filename: Ellipint Circumscribing an Ellipsoid about the Intersection … August 16, 2006 5:03 am

Add to Reading List

Source URL: www.cs.berkeley.edu

Language: English - Date: 2006-08-16 08:09:32
43PRESERVING POSITIVITY FOR MATRICES WITH SPARSITY CONSTRAINTS By Dominique Guillot Apoorva Khare Bala Rajaratnam

PRESERVING POSITIVITY FOR MATRICES WITH SPARSITY CONSTRAINTS By Dominique Guillot Apoorva Khare Bala Rajaratnam

Add to Reading List

Source URL: statistics.stanford.edu

Language: English - Date: 2015-02-17 18:20:05
44Computing the Nearest Correlation Matrix—A Problem from Finance Nicholas J. Higham[removed]MIMS EPrint: [removed]

Computing the Nearest Correlation Matrix—A Problem from Finance Nicholas J. Higham[removed]MIMS EPrint: [removed]

Add to Reading List

Source URL: eprints.ma.man.ac.uk

Language: English - Date: 2006-06-01 12:02:18
45An Improved Arc Algorithm for Detecting Definite Hermitian Pairs Chun-Hua Guo, Nicholas J. Higham and Fran¸coise Tisseur November 2008

An Improved Arc Algorithm for Detecting Definite Hermitian Pairs Chun-Hua Guo, Nicholas J. Higham and Fran¸coise Tisseur November 2008

Add to Reading List

Source URL: eprints.ma.man.ac.uk

Language: English - Date: 2009-06-30 10:40:46
46AN IMPROVED ARC ALGORITHM FOR DETECTING DEFINITE HERMITIAN PAIRS∗ CHUN-HUA GUO† , NICHOLAS J. HIGHAM‡ , AND FRANC ¸ OISE TISSEUR‡ Abstract. A 25-year old and somewhat neglected algorithm of Crawford and Moon att

AN IMPROVED ARC ALGORITHM FOR DETECTING DEFINITE HERMITIAN PAIRS∗ CHUN-HUA GUO† , NICHOLAS J. HIGHAM‡ , AND FRANC ¸ OISE TISSEUR‡ Abstract. A 25-year old and somewhat neglected algorithm of Crawford and Moon att

Add to Reading List

Source URL: eprints.ma.man.ac.uk

Language: English - Date: 2009-06-30 10:39:30
47SIAM J. OPTIM. Vol. 21, No. 2, pp. 572–596 © 2011 Society for Industrial and Applied Mathematics  RANK-SPARSITY INCOHERENCE FOR MATRIX DECOMPOSITION*

SIAM J. OPTIM. Vol. 21, No. 2, pp. 572–596 © 2011 Society for Industrial and Applied Mathematics RANK-SPARSITY INCOHERENCE FOR MATRIX DECOMPOSITION*

Add to Reading List

Source URL: users.cms.caltech.edu

Language: English - Date: 2012-11-05 20:50:29
48Matrix concentration inequalities via the method of exchangeable pairs

Matrix concentration inequalities via the method of exchangeable pairs

Add to Reading List

Source URL: www.cs.berkeley.edu

Language: English - Date: 2014-03-26 14:09:56
49

PDF Document

Add to Reading List

Source URL: www.siam.org

Language: English - Date: 2014-10-28 12:16:14
50Proof that if voting is perfect in one dimension, then the first eigenvector extracted from the double-centered transformed ag

Proof that if voting is perfect in one dimension, then the first eigenvector extracted from the double-centered transformed ag

Add to Reading List

Source URL: www.voteview.com

Language: English - Date: 2012-06-14 10:28:19